Long cycles in graphs with large degree sums
نویسندگان
چکیده
منابع مشابه
Long cycles in graphs with large degree sums
A number of results are established concerning long cycles in graphs with large degree sums. Let G be a graph on n vertices such that d(x) + d(y) + d(z) 3s for all triples of independent vertices x, y, z. Let c be the length of a longest cycle in G and (Y the cardinality of a maximum independent set of vertices. If G is l-tough and s an, then every longest cycle in G is a dominating cycle and c...
متن کاملLong cycles and neighborhood union in 1-tough graphs with large degree sums
For a 1-tough graph G we define σ3(G) = min{d(u) + d(v)+ d(w) : {u, v, w} is an independent set of vertices} and NCσ3−n+5(G) = max{ ⋃ σ3−n+5 i=1 N(vi) : {v1, ..., vσ3−n+5} is an independent set of vertices}. We show that every 1-tough graph with σ3(G) ≥ n contains a cycle of length at least min{n, 2NCσ3−n+5(G) + 2}. This result implies some well-known results of Faßbender [2] and of Flandrin, J...
متن کاملRelative length of long paths and cycles in graphs with large degree sums
Long Paths and Cycles in Graphs with Large D egree Sums Hikoe Enomoto DEPARTMENT 0 F MATHEMATICS, KElO UNIVERSITY, HlYOSHl3-14-1 KOHOKU-KU, YOKOHAMA KANAGAWA 223, JAPAN Jan van den Heuvel* FACULTY OF APPLIED MATHEMATICS UNIVERSITY OF TWENTE, P.O. BOX217 7500 AE ENSCHEDE THE NETHERLANDS Atsushi Kaneko DEPARTMENT OF ELECTRONIC ENGINEERING KOGAKUIN UNlVERSlm, NISHI-SHINJUKU 1-24-2 SHINJUKU-KU, TOK...
متن کاملLong cycles in graphs with large degree sums and neighborhood unions
We present and prove several results concerning the length of longest cycles in 2connected or I-tough graphs with large degree sums. These results improve many known results on long cycles in these graphs. We also consider the sharpness of the results and discuss some possible strengthenings.
متن کاملCycles through subsets with large degree sums
Let G be a 2-connected graph on n vertices and let X C__ V(G). We say that G is X-cyclable if G has an X-cycle, i.e., a cycle containing all vertices of X. We denote by ~(X) the maximum number of pairwise nonadjacent vertices in the subgraph G[X] of G induced by X. If G[X] is not complete, we denote by ~(X) the minimum cardinality of a set of vertices of G separating two vertices of X. By 6(X) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1990
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90055-m